Modeling reducibility on ground terms using constraints
نویسندگان
چکیده
In this note, we explain how to model (ir)reducibility of rewriting on ground terms using (dis)equational constraints. We show in particular that innermost (ir)reducibility can be modeled with a particular narrowing relation and that (dis)equational constraints are issued from the most general unifiers of this narrowing relation.
منابع مشابه
Ground Reducibility is EXPTIME-Complete
We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the computations of an alternating Turing machine whose space is polynomially bounded. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints AR;t to a rewrite system R and a term t. This automaton is d...
متن کاملGround Reducibility and Automata with Disequality Constraints
Using the automata with constraints, we give an algorithm for the decision of ground reducibility of a term t w.r.t. a rewriting system R. The complexity of the algorithm is doubly exponential in the maximum of the depths of t and R and the cardinal of R.
متن کاملComputing Constructor Forms with Non Terminating Rewrite Programs - Extended version -
In the context of the study of rule-based programming, we focus in this paper on the property of C-reducibility, expressing that every term reduces to a constructor term on at least one of its rewriting derivations. This property implies completeness of function definitions, and enables to stop evaluations of a program on a constructor form, even if the program is not terminating. We propose an...
متن کاملNumerical modeling of tunneling induced ground deformation and its control
Tunnelling through cities underlain by soft soil, commonly associated with soil movement around the tunnels and subsequent surface settlement. The predication of ground movement during the tunnelling and optimum support pressure could be based on analytical, empirical or the numerical methods. The commonly used Earth pressure balance (EPB) tunneling machines, uses the excavated soil in a pressu...
متن کاملOn the reducibility of geometric constraint graphs
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard modeling tools. In this discipline, a geometric form is specified by the relations that the components of this form must verify instead of explicitly specifying...
متن کامل